Long-distance phonological processes as tier-based strictly local functions

نویسندگان

چکیده

Whether we analyze phonological processes using a system of rules or constraints, the resulting map from underlying representations to surface pronunciations can be characterized as function. Viewing mathematical objects in this way allows us study properties phonology that hold no matter how it is implemented. Work vein has found majority only consider information within finite window, placing them highly restrictive class Strictly Local (SL) functions (Chandlee 2014; Chandlee et al. 2015). Long-distance processes, however, lie outside capabilities SL since they arbitrarily distant. The more powerful subsequential been offered potential characterization long-distance (Heinz & Lai 2013; Luo 2017; Payne 2017), but argue an intermediate offers natural model. Specifically, by incorporating autosegmental tier (e.g., Goldsmith 1976) into structure function, non-local crucial for applying long- distance rendered local. In addition assessing typological coverage these Tier-based (Burness McMullin 2019; Hao Andersson Bowers 2019), show fail generate two pathological behaviours (minimum requirements and modulo counting) accomplished with We therefore conclude tier-based computation better than computation.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Morphotactics as Tier-Based Strictly Local Dependencies

It is commonly accepted that morphological dependencies are finite-state in nature. We argue that the upper bound on morphological expressivity is much lower. Drawing on technical results from computational phonology, we show that a variety of morphotactic phenomena are tierbased strictly local and do not fall into weaker subclasses such as the strictly local or strictly piecewise languages. Si...

متن کامل

Tier-based Strictly Local Constraints for Phonology

Beginning with Goldsmith (1976), the phonological tier has a long history in phonological theory to describe non-local phenomena. This paper defines a class of formal languages, the Tier-based Strictly Local languages, which describe such phenomena and locates them within the Subregular Hierarchy (McNaughton and Papert, 1971). In particular, these languages contain the Strictly Local languages,...

متن کامل

Tier-based Strictly Local Constraints for Phonology

Beginning with Goldsmith (1976), the phonological tier has a long history in phonological theory to describe non-local phenomena. This paper defines a class of formal languages, the Tier-based Strictly Local languages, which begin to describe such phenomena. Then this class is located within the Subregular Hierarchy (McNaughton and Papert, 1971). It is found that these languages contain the Str...

متن کامل

Learning Tier-based Strictly 2-Local Languages

The Tier-based Strictly 2-Local (TSL2) languages are a class of formal languages which have been shown to model long-distance phonotactic generalizations in natural language (Heinz et al., 2011). This paper introduces the Tier-based Strictly 2-Local Inference Algorithm (2TSLIA), the first nonenumerative learner for the TSL2 languages. We prove the 2TSLIA is guaranteed to converge in polynomial ...

متن کامل

Learning Phonological Mappings by Learning Strictly Local Functions*

The current study identifies locality as a near-universal property of phonological input-output mappings that describe processes with local triggers and presents a learning algorithm which uses locality as an inductive principle to generalize such mappings from finite data. Input-output (or UR-SR) mappings like the one in (1) are integral to both the rewrite rules of Sound Pattern of English (C...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Glossa

سال: 2021

ISSN: ['2397-1835']

DOI: https://doi.org/10.16995/glossa.5780